Location:
Search - b tree
Search list
Description: 树的哈夫曼编码 文档文件中每行以“a:”“b：”的形式输入多个字符及其出现频率。在界
面上点击获取编码，界面上输入数字进行哈夫曼的编码，输入字母可以实现哈夫曼的译码。输入错误字符是提示输入有误。
-Huffman tree for each line of the document file to " a:" " b:" Enter the number of characters in the form of its frequency. Click for code in the interface, the interface input Huffman coding numbers, enter letters, Huffman decoding can be achieved. Input error is prompted to enter the wrong character.
Platform: |
Size: 171008 |
Author: 项链 |
Hits:
Description: 树的哈夫曼编码 文档文件中每行以“a:”“b：”的形式输入多个字符及其出现频率。在界
面上点击获取编码，界面上输入数字进行哈夫曼的编码，输入字母可以实现哈夫曼的译码。输入错误字符是提示输入有误。
-Huffman tree for each line of the document file to " a:" " b:" Enter the number of characters in the form of its frequency. Click for code in the interface, the interface input Huffman coding numbers, enter letters, Huffman decoding can be achieved. Input error is prompted to enter the wrong character.
Platform: |
Size: 189440 |
Author: 项链 |
Hits:
Description: 树的哈夫曼编码。在文档文件中每行以“a:”“b：”的形式输入多个字符及其出现频率。在界
面上点击获取编码，界面上输入数字进行哈夫曼的编码，输入字母可以实现哈夫曼的译码。输入错误字符是提示输入有误。-Huffman tree. Each line in the document file to " a:" " b:" Enter the number of characters in the form of its frequency. Click for code in the interface, the interface input Huffman coding numbers, enter letters, Huffman decoding can be achieved. Input error is prompted to enter the wrong character.
Platform: |
Size: 176128 |
Author: 项链 |
Hits:
Description: 1． 设计和实现一个简单的文件系统，要求包括目录、普通文件和文件的存储
2． 文件系统的目录结构采用类似Linux的树状结构；
3． 要求模拟的操作包括：
a) 目录的添加、删除、重命名；
b) 目录的显示（列表）
c) 文件的添加、删除、重命名
d) 文件和目录的拷贝
4． 用户进入时显示可用命令列表；用户输入help时显示所有命令的帮助文档； 输入某个命令+？时显示该条命令的使用说明
5． 用户输入exit时退出该系统
6． 实验实现基于windows平台；
7． 实验开发语言可以选用C/c++
-1. Design and implement a simple file system requirements include directories, regular files and file storage 2. File system directory structure similar to Linux' s tree 3. Requires simulation of the operation include: a) the directory to add, delete, rename b) display the directory (list) c) files to add, delete, rename, d) copies of files and directories 4. Displayed when the user enters a list of available commands user input help to display all commands with the help of documents enter a command+? Which command to display instructions 5. When the user enters exit to exit the system 6. Windows-based platform for experiments 7. Experimental development of language can be selected C/c++
Platform: |
Size: 311296 |
Author: 皇絮淡 |
Hits:
Description: 二叉树也是递归定义的，其结点有左右子树之分，逻辑上二叉树有五种基本形态： (1)空二叉树——(a)； (2)只有一个根结点的二叉树——(b)； (3)右子树为空的二叉树——(c)； (4)左子树为空的二叉树——(d)； (5)完全二叉树——(e)注意：尽管二叉树与树有许多相似之处，但二叉树不是树的特殊情形。
-Binary tree is recursively defined, and its sub-tree nodes are so divided, there are five basic logical form of binary tree: (1) empty binary tree- (a) (2) there is only one root node Binary Tree- (b) (3) the right subtree of the binary tree is empty- (c) (4) the left subtree of the binary tree is empty- (d) (5) completely Binary Tree- (e) Note: Although the binary tree and the tree has many similarities, but the binary tree is not a special case.
Platform: |
Size: 1024 |
Author: zn |
Hits:
Description: 用C实现的一段B树源码。 是一个简单的示例，主要介绍如何实现B树的建立，插入、查询、删除等功能-Section B with the C implementation source code tree. Is a simple example, describes how to build a tree B, insert, query, delete, etc.
Platform: |
Size: 16384 |
Author: yang_pdager |
Hits:
Description: b-树用vc＋＋实现，每一步都有演示效果-b－ tree with c++
Platform: |
Size: 2332672 |
Author: jack |
Hits:
Description: Write efficient functions (and give their Big-Oh running times)that take a pointer to a binary tree root T and compute:
a.The number of leaves of T
b.The number of nodes in T that contain one non-NULL child
c.The number of nodes in T that contain two non-NULL children-Write efficient functions (and give their Big-Oh running times) that take a pointer to a binary tree root T and compute: a.The number of leaves of T b.The number of nodes in T that contain one non-NULL child c . The number of nodes in T that contain two non-NULL children
Platform: |
Size: 246784 |
Author: |
Hits:
Description: 实现了B树的创建，在此基础上，构建搜索信息，完成了搜索，添加，删除，显示树形等操作-Realized B the creation of a tree, based on this information, the construction of the search, completing the search, add, delete, shows such as tree operation
Platform: |
Size: 1826816 |
Author: |
Hits:
Description: 大二数据结构的实验，里面包含实验报告、源码、可执行文件，用VC++6.0开发的。动态查找表。功能齐全，实现 二叉排序树、平衡二叉树、B_树、2-3树、B+树。-
Experimental sophomore data structures, which contains experimental reports, source code, executable file, using VC++6.0 development. Dynamic look-up table. Functional, to achieve binary sort tree, balanced binary tree, B_ tree, 2-3 tree, B+ trees.
Platform: |
Size: 572416 |
Author: 麦思明 |
Hits:
Description: 数据结构与算法实验题 8.2 树求和问题
★ 实验任务
我 们 知 道树有 许 多 种表示 法 ， 左儿子 右 兄 弟就是 一 种 表示法 。 现 在给出 一 棵 以左儿 子 右 兄 弟表 示的 树 ，并 且结 点 带有 权值 ， 求以 给出 结 点为 根的 子 树的 所有 结 点权 值之 和。对 于给出的一棵树的左儿子右兄弟表示法，按要求输出这棵树的子树的权值和。
★ 数据输入
第一行为一个整数 n ， 1<=n<=1000 ，表示这棵树的结点数，编号为 1 到 n 。
接下来有 n 行，每行表示一个结点的信息。对于每行，第一个整数 b ，表示结点的编号， 第二个整数 m ，表示该结点权值，第三个整数 ls ，表示这个结点的左儿子编号， 0 表示无左 儿子，第四个整数 rb ，表示这个结点的右兄弟编号， 0 代表无右兄弟。
接下来有一个整数 Q ，表示有 Q 个询问。
接下来 Q 行，每行一个整数 num ，表示询问以编号 num 结点为根的子树的所有结点权
值和。
★ 数据输出
输出有 Q 行，每行对应一个询问，包括一个整数，表示该子树所有结点权值和。
输入示例
5
1220 2353 3404 4100 5500 2 1 2
输出示例
15 8-Data structure and algorithms experimental subject 8.2 tree peace problem
9:28 experiment task
I know the way many more trees of said method, son left right is a kind of representation brother younger brother. Now a tree in a given to left son son and brother younger brother table right of the tree, and with weights and "point, asks to give" for the root point of all the "point son tree of weights and. In a tree to the son left are right brother representation, according to the requirements of this tree output tree weights and the son.
9:28 data input
The first behavior an integer n, 1 < = n < = 1000, said the tree "points, Numbers for 1 to n.
Then there is n line, each row a node of the said information. For each line, the first integer b, said the Numbers of the node, the second integer m, said the node s weight, the third integer ls, said the node left son Numbers, 0 means no son left, the fourth integer rb, said the node right brother Numbers, 0 (no right broth
Platform: |
Size: 1024 |
Author: ljxiaoya |
Hits:
Description: 输出孩子兄弟树T中的各边，形式是以a->b的模式依次输出的-Each side of the output children brothers linked list tree
Platform: |
Size: 708608 |
Author: Davy Lee |
Hits:
Description: 文本为一个用c语言编写用于产生一个二叉树的源码文本。以三元组形式输入任意二叉树（以大写字母表示结点），求以任意一选定结点为子树的深度。如，在输入示范题中的二叉树之后，程序显示：Please select a node: 输入 ‘B’，回车后，程序显示‘3’。-Text for a written in c used to produce a binary tree source text. With three yuan group form input arbitrary binary tree (with a capital letter says node), asks to a selected node for any son the depth of the tree. If the input and demonstration of the question after the binary tree, the program shows: Please select a node: input "B", enter, the program shows 3 ".
Platform: |
Size: 1024 |
Author: 梅剑寒 |
Hits:
Description: Spanning Tree
click --server - main.bat
click A,B,C,D,E,F
DSN Name - spanning
Platform: |
Size: 3894272 |
Author: raveesha |
Hits:
Description: 输入一个中序的表达式(比如:a*(b+c)-d)
将这个表达式构建一棵二叉树,然后打印出来就是.-Input a sequence of expression (for example: a* (b+ c)-d)
Will this expression building a tree binary tree, then it is printed
Platform: |
Size: 641024 |
Author: 方期待 |
Hits:
Description: PAV (H265) 是 音视频 压缩解压 协议，非常不同于H264/MPEG4，ZPAV (H265) 的基本算法 是 小波，多级树集合群，广义小波，数学形态小波，......
ZPAV (H265) 基本算法 ：
1，图象与声音分解与合成 ：小波 ；
2，图象与声音前处理 ：小波子带零交叉降噪，目标纹理处理，语音处理 ；
3，速率控制 ：小波子带熵速率控制 ；
4，量化与反量化 ：小波子带熵量化与反量化 ；
5，低频分量和高频分量的降维 ：小波子带邻域交叉降维 ；
6，运动矢量和量化表的分解与合成 ：广义小波 ；
7，位面编码 ：数学形态小波，多级树集合群，嵌入零树，位面降维 ；
8，位流编码 ：算术编码，熵编码 ；
9，运动估计 ：宏块最优决策，运动矢量预测 ；
A，运动搜索 ：钻石，大钻石，小钻石，方形 ；
B，图象与声音后处理 ：低通滤波，断点重构，宏块平滑 ；
C，误码纠错 ：矢量仿真，帧间仿真 。
-The PAV (H265) is the audio and video compression and decompression protocol, is very different from H264/MPEG4
ZPAV (H265) algorithm is a wavelet, multi-level tree collection group, and generalized wavelets, mathematical morphology, wavelet, ...
ZPAV (H265) algorithm:
1, image and sound decomposition and synthesis: wavelet
2, image and sound processing: wavelet sub-band zero-crossing noise, target texture processing, speech processing
3, the rate control: wavelet subband entropy rate control
4, quantization and inverse quantization: Wavelet subband entropy quantization and inverse quantization
5, the dimensionality reduction of the low frequency component and high frequency components: the wavelet subbands neighborhood cross-dimensionality reduction
6, the decomposition and synthesis of the motion vector and quantization tables: generalized wavelet
7, bit-plane coding: the mathematical form of wavelet multi-level tree collection group, embedded zerotree, bit plane
Platform: |
Size: 4826112 |
Author: 李阳 |
Hits:
Description: 1. 识别java源码的语法结构，生成结点类型为具体源码成份的结点树。
2. 解析Java源码并从指定的方法入口处开始执行，在执行的过程中可以执行外部插入的执行逻辑。类似于AOP，但所截获的目标可以是方法也可以是任意细粒度的代码。
3. 解析Java源码并从指定的方法入口处开始执行，在执行过程中对不合理的代码进行预警。预警功能是我兴趣所在，亦将得到大力加强。
4. 静态处理：
① 对源码进行合法性检查，以保证其符合具体项目中的要求。类似于Java代码缺陷自动分析工具“Findbugs”.
② 执行某些复杂的重构任务，如将数组改为java.util.List，改变方法调用中的参数秩序，如将方法count(int a, String b)改写为count(String b, int a)。-A. Identify the grammatical structure of the Java source generated node type for the composition of the specific source node tree. 2 parse Java source code and start from the specified method at the entrance to the execution logic in the process of implementation can be performed externally inserted. Similar to the AOP, but intercepted by the target can be arbitrarily fine-grained code. 3 parsing Java source code and start from the entrance to the method specified warning unreasonable code in the implementation process. The early warning function is my interest, and will be significantly strengthened. 4 static processing: ① check the legality of the source code, to ensure that they meet specific project requirements. Similar to the Java code defect automatic analysis tools Findbugs. " ② perform the complex task of reconstruction, such as the array to be changed of java.util.List, change the parameter order in the method call, method count (int a, a String b) be rewritten as count (
Platform: |
Size: 1627136 |
Author: jinbingwei |
Hits:
Description: 一些算法的简单实现，最大流最小割、B树、最大堆、最短路径等-Simple implementation of the algorithm, the maximum flow minimum cut tree B, the maximum heap shortest path
Platform: |
Size: 6144 |
Author: yougong |
Hits:
Description: C++编写的电路树的生成。生成B，Q，A阵-The circuit tree prepared by C++ generated. To generate B, Q, A Array
Platform: |
Size: 2048 |
Author: 周毅博 |
Hits:
Description: 如果要让游戏里的角色或者NPC能执行预设的AI逻辑，最简单的用IF..ELSE...神器既可以实现，但是再复杂的一般用经典的状态机来切换状态，但是编辑器写起来比较麻烦。相对的，行为树（Behavior Tree）理解和编辑起来就非常简单了。行为树，其实也是一种有限状态机，只不过形式上分层呈树结构，人称分层有限状态机（HFSM）。-ntax Label Name Description A Component Name Speci es a component B Behavior...3 Tree Naming Conventions The following conventions are used to refer to
Platform: |
Size: 3668992 |
Author: 颜学农 |
Hits: